ArcadeVibe Hub
Home About Contact
Browse Categories
Advertisement
Match-3 Puzzle

Shelf Sort: Matching Puzzle

🎮 Game Player

Reviews

Shelf Sort offers a fresh take on matching puzzles by adding a layer of discovery. The hidden items and strategic depth keep each level engaging without being stressful. The colorful graphics and simple controls make it accessible for casual players, while the need for planning appeals to puzzle enthusiasts. It is a safe, family-friendly game that provides a calming yet rewarding experience.

About This Game

Game Introduction

Shelf Sort is a matching puzzle game where players bring order to disorganized shelves. Each level presents a shelf packed with colorful items such as books, toys, and plants. Only the front layer of items is visible at the start. The core objective is to find and clear groups of three or more identical items from this outer layer. As items are removed, new layers and hidden treasures are revealed, creating a fresh puzzle with every move. The game combines the satisfaction of organizing with the challenge of strategic matching, making each level a unique discovery. It is designed to be accessible for casual players while offering enough depth for puzzle enthusiasts. The cheerful graphics and simple concept make it inviting for players of all ages.

How to Play

Playing Shelf Sort is straightforward. On each level, examine the outermost visible layer of the shelf. Look for any three or more identical items grouped together. Tap or click on one of these matching sets to remove them from the shelf. This action reveals the items that were behind them, allowing you to see new potential matches. Continue this process, clearing groups as they become visible. The goal is to remove all items from the shelf to complete the level. Think ahead, as clearing certain items first can create chains of matches and help you access deeper layers. The simple controls make it easy for anyone to start, but strategic planning adds depth for experienced players.

Game Features

Shelf Sort offers engaging matching puzzle mechanics that require observation and planning. Hidden layers and treasures are uncovered as you clear items, adding surprise and variety. The game is family-friendly and safe for all ages with no violent or inappropriate content. Simple controls are easy to learn but offer strategic depth for challenging gameplay. Colorful and cheerful graphics create a pleasant and inviting visual experience. Progressively challenging levels keep the game fresh and rewarding. The satisfying cleanup gameplay provides a sense of accomplishment with each completed shelf.

Tips for Success

To excel in Shelf Sort, take your time to scan the entire visible layer before making a move. Prioritize clearing items that block access to deeper layers or that create chain reactions. Look for opportunities to match items that are near each other to avoid running out of space. Practice regularly to improve your pattern recognition and planning skills. Stay patient and enjoy the calming process of tidying each shelf, as rushing can lead to missed matches.

✅ Compatibility & Testing

• Desktop (Windows 11, macOS Ventura)
• Mobile (iPhone 14, Samsung Galaxy S23)
• Tablet (iPad Pro, Android tablet)
✅Supported browsers: Chrome, Safari, Edge, Firefox (latest versions)
❌ Not supported: Internet Explorer, older browser versions

FAQ

Is Shelf Sort free to play?
Shelf Sort is typically free to play with optional in-app purchases for hints or extra moves. Check the app store listing for specific pricing details.
Does Shelf Sort work offline?
Shelf Sort may offer offline play after initial download, but some features like daily challenges or leaderboards might require an internet connection.
Are there time limits in Shelf Sort?
Shelf Sort generally does not have time limits, allowing players to think and plan their moves at their own pace for a relaxing experience.
Can I play Shelf Sort on both phone and tablet?
Shelf Sort is designed for mobile devices and should work on both phones and tablets. Check the app store for compatibility with your specific device.
How many levels are in Shelf Sort?
The number of levels in Shelf Sort may vary by version, but it typically includes many progressively challenging levels with regular updates adding new content.
Does Shelf Sort have any sound or music?
Shelf Sort includes cheerful background music and sound effects that enhance the gameplay. Players can usually adjust or mute these in the settings menu.

Player Comments

0 comments
U
User
Loading comments...
// Game Controls: Like / Dislike / Fav (function () { var likeBtn = document.getElementById('likeBtn'), dislikeBtn = document.getElementById('dislikeBtn'), favBtn = document.getElementById('favBtn'); var likeCount = document.querySelector('#likeBtn .ctrl-count'); var liked = false, disliked = false, faved = false, baseLikes = 4900; var commentsSec = document.getElementById('commentsSection'); var gameId = (commentsSec && commentsSec.dataset && commentsSec.dataset.gameId) || ''; function renderCount() { if (!likeCount) return; var c = baseLikes + (liked ? 1 : 0); likeCount.textContent = c >= 1000 ? (c / 1000).toFixed(1) + 'K' : c; } if (likeBtn) { likeBtn.addEventListener('click', function () { if (disliked) { disliked = false; dislikeBtn.classList.remove('active'); } liked = !liked; likeBtn.classList.toggle('active', liked); renderCount(); if (typeof apiService !== 'undefined' && gameId) { apiService.likeGame(gameId).then(function (r) { if (r && r.code === 0) showToast(liked ? 'Liked!' : 'Like removed', 'success'); }).catch(function () { showToast('Action failed', 'error'); }); } }); } if (dislikeBtn) { dislikeBtn.addEventListener('click', function () { if (liked) { liked = false; likeBtn.classList.remove('active'); renderCount(); } disliked = !disliked; dislikeBtn.classList.toggle('active', disliked); if (typeof apiService !== 'undefined' && gameId) { apiService.dislikeGame(gameId).then(function (r) { if (r && r.code === 0) showToast(disliked ? 'Disliked' : 'Dislike removed', 'success'); }).catch(function () { showToast('Action failed', 'error'); }); } }); } if (favBtn) { favBtn.addEventListener('click', function () { if (typeof apiService === 'undefined' || !apiService.isLoggedIn()) { if (typeof showToast === 'function') showToast('Please login first', 'warning'); return; } faved = !faved; favBtn.classList.toggle('active', faved); var icon = favBtn.querySelector('i'); if (icon) icon.className = faved ? 'fa fa-bookmark' : 'fa fa-bookmark-o'; var action = faved ? apiService.addFavorite(gameId) : apiService.removeFavorite(gameId); action.then(function (r) { if (r && r.code === 0) { showToast(faved ? 'Bookmarked!' : 'Bookmark removed', 'success'); } else if (r && r.code === 401) { faved = !faved; favBtn.classList.toggle('active', faved); if (icon) icon.className = faved ? 'fa fa-bookmark' : 'fa fa-bookmark-o'; showToast('Please login first', 'warning'); } else { showToast(r && r.msg ? r.msg : 'Operation failed', 'error'); } }).catch(function () { showToast('Network error', 'error'); }); }); } })(); // Favorite var isFavorited = false; var isToggling = false; function showToast(message, type) { type = type || 'success'; var toast = document.querySelector('.pl-toast'); if (!toast) { toast = document.createElement('div'); toast.className = 'pl-toast'; document.body.appendChild(toast); } toast.textContent = message; toast.className = 'pl-toast ' + type; setTimeout(function () { toast.classList.add('pl-show'); }, 10); setTimeout(function () { toast.classList.remove('pl-show'); }, 3000); } async function checkFavoriteStatus() { var btn = document.getElementById('favoriteBtn'); if (!btn) return; var gameId = btn.dataset.gameId; if (typeof apiService === 'undefined' || !apiService.isLoggedIn()) return; try { var fav = await apiService.checkFavorite(gameId); isFavorited = fav; updateFavoriteButton(); } catch (e) { } } function updateFavoriteButton() { var btn = document.getElementById('favoriteBtn'); if (!btn) return; if (isFavorited) { btn.classList.add('pl-faved'); } else { btn.classList.remove('pl-faved'); } } async function toggleFavorite() { var btn = document.getElementById('favoriteBtn'); if (!btn) return; var gameId = parseInt(btn.dataset.gameId); if (typeof apiService === 'undefined' || !apiService.isLoggedIn()) { showToast('Please login first', 'warning'); return; } if (isToggling) return; isToggling = true; try { var result; if (isFavorited) { result = await apiService.removeFavorite(gameId); } else { result = await apiService.addFavorite(gameId); } if (result.code === 0) { isFavorited = !isFavorited; updateFavoriteButton(); showToast(isFavorited ? 'Added to favorites' : 'Removed from favorites', 'success'); } else if (result.code === 401) { showToast('Please login first', 'warning'); } else if (result.code === 400) { await checkFavoriteStatus(); showToast(result.msg || 'Operation failed', 'error'); } else { showToast(result.msg || 'Operation failed', 'error'); } } catch (e) { showToast('Network error', 'error'); } finally { isToggling = false; } } // Comments var commentsPage = 1; var hasMoreComments = false; var selectedRating = 5; function initCommentForm() { var form = document.getElementById('commentForm'); if (!form) return; if (typeof apiService !== 'undefined' && apiService.isLoggedIn()) { var info = apiService.getMemberInfo(); if (info) { var nameEl = document.getElementById('currentUserName'); if (nameEl) nameEl.textContent = info.nickname || 'User'; var avatarEl = document.getElementById('currentUserAvatar'); if (avatarEl) { if (info.avatar) { avatarEl.innerHTML = 'Avatar'; } else { avatarEl.textContent = (info.nickname || 'User').charAt(0).toUpperCase(); } } } setRating(5); } } function setRating(rating) { selectedRating = rating; var stars = document.querySelectorAll('.pl-star'); stars.forEach(function (star, index) { if (index < rating) { star.classList.add('pl-on'); } else { star.classList.remove('pl-on'); } }); } async function submitComment() { var commentsSection = document.getElementById('commentsSection'); var gameId = commentsSection ? commentsSection.dataset.gameId : null; if (!gameId) { var favBtn = document.getElementById('favoriteBtn'); gameId = favBtn ? favBtn.dataset.gameId : null; } if (!gameId) { showToast('Game ID not found', 'error'); return; } var content = document.getElementById('commentContent').value.trim(); if (!content) { showToast('Please enter comment content', 'warning'); return; } var submitBtn = document.getElementById('submitComment'); submitBtn.disabled = true; try { var result = await apiService.addComment(gameId, content, selectedRating); if (result.code === 0) { showToast('Comment posted successfully', 'success'); document.getElementById('commentContent').value = ''; setRating(5); commentsPage = 1; loadComments(1); } else if (result.code === 401) { showToast('Please login first', 'warning'); } else { showToast(result.msg || 'Failed to post comment', 'error'); } } catch (e) { showToast('Network error', 'error'); } finally { submitBtn.disabled = false; } } async function loadComments(page) { var commentsSection = document.getElementById('commentsSection'); var gameId = commentsSection ? commentsSection.dataset.gameId : null; if (!gameId) { var favBtn = document.getElementById('favoriteBtn'); gameId = favBtn ? favBtn.dataset.gameId : null; } if (!gameId) return; var list = document.getElementById('commentsList'); var loadMoreBtn = document.getElementById('loadMoreComments'); try { var result = await apiService.getGameComments(gameId, page, 10); if (result.code === 0) { var data = result.data; var comments = data.list || []; if (page === 1) list.innerHTML = ''; if (comments.length === 0) { if (page === 1) { list.innerHTML = '
💬

No comments yet. Be the first!

'; } loadMoreBtn.style.display = 'none'; hasMoreComments = false; return; } comments.forEach(function (c) { var item = document.createElement('div'); item.className = 'pl-comment'; var avatarHtml = '
' + (c.nickname ? c.nickname.charAt(0).toUpperCase() : 'U') + '
'; if (c.avatar) { avatarHtml = '
' + (c.nickname || 'Avatar') + '
'; } item.innerHTML = '
' + avatarHtml + '
' + (c.nickname || 'Anonymous') + '
' + (c.create_time || '') + '
' + (c.star_html || '') + '
' + (c.content || '') + '
'; list.appendChild(item); }); document.getElementById('commentsCount').textContent = (data.total || comments.length) + ' comments'; hasMoreComments = data.total > page * 10; loadMoreBtn.style.display = hasMoreComments ? 'block' : 'none'; loadMoreBtn.disabled = false; } else { if (page === 1) { list.innerHTML = '
Failed to load comments
'; } } } catch (e) { if (page === 1) { list.innerHTML = '
Network error
'; } } } var _loadMoreBtn = document.getElementById('loadMoreComments'); if (_loadMoreBtn) { _loadMoreBtn.addEventListener('click', function () { if (hasMoreComments) { commentsPage++; this.disabled = true; loadComments(commentsPage); } }); } function _waitForApiService(callback, maxRetries) { maxRetries = maxRetries || 50; var tries = 0; function check() { if (typeof apiService !== 'undefined') { callback(); } else if (tries < maxRetries) { tries++; setTimeout(check, 100); } else { console.warn('apiService not available after retries'); } } check(); } function _initDetailPage() { if (typeof initCommentForm === 'function') initCommentForm(); if (typeof checkFavoriteStatus === 'function') checkFavoriteStatus(); if (typeof loadComments === 'function') loadComments(1); } document.addEventListener('DOMContentLoaded', function () { _waitForApiService(_initDetailPage); });

Share this page

Copy the link below and share it with your friends!